Cylindrical Algebraic Sub-Decompositions

نویسندگان

  • David J. Wilson
  • Russell J. Bradford
  • James H. Davenport
  • Matthew England
چکیده

Cylindrical Algebraic Decompositions (CADs) have been studied since their creation as a tool for working with semi-algebraic sets and eliminating quantifiers of the reals. In this paper we are concerned with Cylindrical Algebraic Sub-Decompositions (sub-CADs), defined as subsets of CADs sufficient to describe the solutions for given formulae. We discuss several ways to construct sub-CADs, both from new work and the literature, and we demonstrate their interaction. We define a manifold sub-CAD as those cells in a CAD lying on a designated manifold and a layered sub-CAD as those cells with prescribed dimensions. We present algorithms to produce both and then describe how the ideas may be combined with each other, as well as their interaction with the recent theory of Truth-Table Invariant CAD (TTICAD). We give a complexity analysis for manifold sub-CADs and 1-layered manifold sub-CADs and present examples where these techniques can be of use, offering substantial savings on previous approaches. All concepts have been fully implemented in a Maple package and examples demonstrate that they can offer substantial savings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An implementation of Sub-CAD in Maple

Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications in algebraic geometry and beyond. We have previously reported on an implementation of CAD in Maple which offers the original projection and lifting algorithm of Collins along with subsequent improvements. Here we report on new functionality: specifically the ability to ...

متن کامل

Computing Smooth Feedback Plans Over Cylindrical Algebraic Decompositions

In this paper, we construct smooth feedback plans over cylindrical algebraic decompositions. Given a cylindrical algebraic decomposition on R, a goal state xg , and a connectivity graph of cells reachable from the goal cell, we construct a vector field that is smooth everywhere except on a set of measure zero and the integral curves of which are smooth (i.e., C∞) and arrive at a neighborhood of...

متن کامل

An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions

In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real space. The incrementality comes from the first part of the algorithm, where a complex cylindrical tree is constructed by refining a previous complex cylindri...

متن کامل

Divide-And-Conquer Computation of Cylindrical Algebraic Decomposition

We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets of the subformulas, and combines the results using the algorithm first introduced in [34]. We propose a graph-based heuristic to find a suitable partitioning ...

متن کامل

Complexity of Computations with Pfaffian and Noetherian Functions

This paper is a survey of the upper bounds on the complexity of basic algebraic and geometric operations with Pfaffian and Noetherian functions, and with sets definable by these functions. Among other results, we consider bounds on Betti numbers of sub-Pfaffian sets, multiplicities of Pfaffian intersections, effective Lojasiewicz inequality for Pfaffian functions, computing frontier and closure...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematics in Computer Science

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2014